On Automating Process Algebra Proofs
نویسندگان
چکیده
In 10] Groote and Springintveld incorporated several model-oriented techniques { such as invariants, matching criteria, state mappings { in the process-algebraic framework of CRL for structuring and simplifying protocol veriications. In this paper, we formalise these extensions in Coq, which is a proof development tool based on type theory. In the updated framework, the length of proof constructions is reduced significantly. Moreover, the new approach allows for more automation (proof generation) than was possible in the past. The results are illustrated by an example in which we prove two queue representations equal.
منابع مشابه
Automating the Search for Elegant Proofs* M
m proof is presented in detail through a sequence of experiments. Although clearly not an algorithm, the ethodology is sufficiently general to enable its use for seeking elegant proofs regardless of the domain o c of study. In addition to (usually) being more elegant, shorter proofs often provide the needed path t onstructing a more efficient circuit, a more effective algorithm, and the like. T...
متن کاملAutomation of Diagrammatic Reasoning
Theorems in automated theorem proving are usually proved by logical formal proofs. However, there is a subset of problems which humans can prove in a different way by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is more clearly perceived in these than in the corresponding algebraic proofs: they capture an intuitive notion of truthfulness that humans find e...
متن کاملTowards Automated Proof Support for Probabilistic Distributed Systems
The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience indicates [12, 4, 11] that there are many difficulties in automating real-number arithmetic in the context of other program features. In this paper we propose a framework for verification of probabilistic distributed systems bas...
متن کاملVerifying Process Algebra Proofs in Type Theory
In this paper we study automatic veri cation of proofs in process algebra Formulas of process algebra are represented by types in typed calculus Inhabitants terms of these types represent proofs The speci c typed calculus we use is the Calculus of Inductive Constructions as implemented in the interactive proof construction program COQ
متن کاملAutomating Proofs of Partially Ordered Model Transformations
This report discusses the feasibility of automating the proofs of transformations between partially ordered models. It extends the work of the author’s initial report [12] on model transformations with constructive type theory, by formalising a model as a partial order over classes, and a model transformation as a nested set of pre and post-conditions. This opens up the proofs of common kinds o...
متن کامل